/*
 * @Date: 2021-09-09 19:51:20
 * @Author: Acckno1
 * @LastEditTime: 2021-09-09 20:04:06
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}


inline void solution() {
    string last;
    int m;
    cin >> last >> m;
    m -- ;
    while (m -- ) {
        string cur = "";
        int cnt = 1;
        for (int i = 1; i < last.size(); i ++ ) {
            if (last[i] != last[i - 1]) {
                cur += last[i - 1] + to_string(cnt);
                cnt = 1;
            } else cnt ++ ;
        }
        if (cnt) 
            cur += last.back() + to_string(cnt);
        last = cur;
    }
    cout << last << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}